Sampling Strategies and Local Search for Stochastic Combinatorial Optimization
نویسندگان
چکیده
In recent years, much attention has been devoted to the development of metaheuristics and local search algorithms for tackling stochastic combinatorial optimization problems. In this paper, we propose an effective local search algorithm that makes use of empirical estimation techniques for a class of stochastic combinatorial optimization problems. We illustrate our approach and assess its performance on the probabilistic traveling salesman problem. Experimental results show that our approach is very competitive.
منابع مشابه
Winner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملAdaptive Sample Size and Importance Sampling in Estimation-based Local Search for Stochastic Combinatorial Optimization: A complete analysis
Metaheuristics and local search algorithms have received considerable attention as promising methods for tackling stochastic combinatorial optimization problems. However, in stochastic settings, these algorithms are usually simple extensions of the versions that are originally designed for deterministic optimization and often they lack rigorous integration with techniques that handle the stocha...
متن کاملDiscrete Optimization Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem
The probabilistic traveling salesman problem is a paradigmatic example of a stochastic combinatorial optimization problem. For this problem, recently an estimation-based local search algorithm using delta evaluation has been proposed. In this paper, we adopt two well-known variance reduction procedures in the estimation-based local search algorithm: the first is an adaptive sampling procedure t...
متن کاملAdaptive Sample Size and Importance Sampling in Estimation-based Local Search for the Probabilistic Traveling Salesman Problem: A complete analysis
The probabilistic traveling salesman problem is a paradigmatic example of a stochastic combinatorial optimization problem. For this problem, recently an estimation-based local search algorithm using delta evaluation has been proposed. In this paper, we adopt two wellknown variance reduction procedures in the estimation-based local search algorithm: The first is an adaptive sampling procedure th...
متن کاملAdaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem
The probabilistic traveling salesman problem is a paradigmatic example of a stochastic combinatorial optimization problem. For this problem, recently an estimation-based local search algorithm using delta evaluation has been proposed. In this paper, we adopt two well-known variance reduction procedures in the estimation-based local search algorithm: the first is an adaptive sampling procedure t...
متن کامل